An open tool to compute stochastic bounds on steady-state distributions and rewards
نویسندگان
چکیده
We present X-Bounds, a new tool to implement a methodology based on stochastic ordering, algorithmic derivation of simpler Markov chains and numerical analysis of these chains. The performance indices defined by reward functions are stochastically bounded by reward functions computed on much simpler or smaller Markov chains obtained after aggregation or simplification. This leads to an important reduction on numerical complexity. Typically, chains are ten times smaller and the accuracy may be good enough.
منابع مشابه
Longest Path in Networks of Queues in the Steady-State
Due to the importance of longest path analysis in networks of queues, we develop an analytical method for computing the steady-state distribution function of longest path in acyclic networks of queues. We assume the network consists of a number of queuing systems and each one has either one or infinite servers. The distribution function of service time is assumed to be exponential or Erlang. Fu...
متن کاملTight Polynomial Bounds for Steady-State Performance of Marked Graphs
The problem of computing both upper and lower bounds for the steady-state performance of timed and stochastic Marked Graphs is studied. In particular, Linear Programming problems deened on the incidence matrix of the underlying Petri nets are used to compute tight (i.e., reachable) bounds for the throughput of transitions for live and bounded Marked Graphs with time associated with transitions....
متن کاملSub-stochastic matrix analysis and performance bounds
On the one hand, the state space of complex Markovian models can often be partitioned between a small subset with a high steady-state probability and a large subset with a low steady-state probability. On the other hand, performance evaluation and reliability analysis require the computation of performance indices, often defined as functions of instantaneous rewards on the states of the model. ...
متن کاملStochastic Bounding of PEPA Models
Stochastic bounds are a valuable tool for analysing large Markov chains. If the chain is too large to solve, we can construct upper and lower bounding chains that are easier to solve, and whose steady state solutions will bound that of the original chain. In [Fourneau et al, 2004], an algorithm is presented to construct lumpable bounding chains, which can be aggregated and solved. In a stochast...
متن کاملStochastic Comparison approach for Stochastic Model Checking
Stochastic model checking requires the computation of steady-state or transient distribution for finite or infinite Markov chains for the evaluation of some formulas implying probabilities. However the numerical analysis of Markov chains is much less efficient than the sophisticated algorithmic techniques such as MTBDD developed for the deterministic model checking. We propose to simplify the n...
متن کامل